Constructions of Bipartite and Bipartite-regular Hypermaps

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of Bipartite and Bipartite-regular Hypermaps

A hypermap is bipartite if its set of flags can be divided into two parts A and B so that both A and B are the union of vertices, and consecutive vertices around an edge or a face are contained in alternate parts. A bipartite hypermap is bipartiteregular if its set of automorphisms is transitive on A and on B. In this paper we see some properties of the constructions of bipartite hypermaps desc...

متن کامل

Bipartite-uniform Hypermaps on the Sphere

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour, hyperedges and hyperfaces, elements have common valencies. The flags of a bipartite hypermap are naturally 2-coloured by assigning the colour of its adjacent h...

متن کامل

Bipartite-Uniform Hypermaps on the Sphere

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform if within each of the sets of hypervertices of the same colour, hyperedges and hyperfaces, all the elements have the same valency. The flags of a bipartite hypermap are naturally 2-coloured by assigning the colour of its adj...

متن کامل

Constructions of small regular bipartite graphs of girth 6

In this article, some structures in the projective plane of order q are found which allow us to construct small k regular balanced bipartite graphs of girth 6 for all k ≤ q . When k = q , the order of these q-regular graphs is 2(q2−1); andwhen k ≤ q−1, the order of these k -regular graphs is 2(qk − 2). Moreover, the incidence matrix of a k -regular balanced bipartite graph of girth 6 having 2(q...

متن کامل

q - regular bipartite graphs

An explicit construction of a family of binary LDPC codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2012

ISSN: 1077-8926

DOI: 10.37236/2768